Efficient data structures for Boolean functions
نویسندگان
چکیده
منابع مشابه
Generation of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کاملEfficient Minimization Method for Incompletely Defined Boolean Functions
The paper presents a minimization algorithm for Boolean functions whose values are defined only for a small part of their range. In contrast to other known minimization algorithms, it uses the "start big" strategy gradually reducing the dimensionality of a term until an implicant is generated. This approach leads to a very fast solution even for problems with several hundreds of input variables...
متن کاملGeneration of Efficient Codes for Realizing Boolean Functions in Nanotechnologies
1. Abstract We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. In our approach, defect tolerance is achieved through a novel coding of Boolean func...
متن کاملVisual Data Mining Using Monotone Boolean Functions
This paper describes a new technique for extracting patterns and relations visually from multidimensional binary data using monotone Boolean functions. Visual Data Mining (VDM) has shown benefits in many areas when used with numerical data, but that technique is less beneficial for binary data. This problem is especially challenging in medical applications tracked with binary symptoms. The prop...
متن کاملCache Conscious Data Structures for Boolean Satisfiability Solvers
Current SAT solvers are well engineered and highly efficient, and significant research effort has been put into creating data structures that can produce maximal efficiency for the core propagation engine within SAT solvers. However, there is still substantial room for improvement. As the disparity between CPU speeds and cache sizes have increased, cache conscious data structures and algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)90790-r